Voting with unconditional privacy: CFSY for booth voting
نویسنده
چکیده
We adapt the Cramer, Franklin, Schoenmaker and Yung internet voting protocol[12] to the booth setting. In this protocol, expressions of the form g 0g x1
منابع مشابه
Voting with unconditionally privacy: CFSY for booth voting
In this note we simplify the Cramer, Franklin, Schoenmaker and Yung internet voting protocol to the booth setting. In it, objects of the form g 0g x1 1 · · · g xl l (mod q) are used to define an unconditionally hiding commitment scheme. Because of their homomorphic properties they are particularly suited for voting protocols with unconditional privacy. In fact, we show that almost all existing ...
متن کاملVoting with Unconditional Privacy by Merging Prêt-à-Voter and PunchScan
We present a detailed comparison of the Prêt-àVoter and Punchscan protocols for booth voting. We also describe a simpler variation that keeps the ballot layout of Prêt-àVoter but borrows the cryptography from Punchscan, which is based on any commitment scheme. By using unconditionally hiding commitments we obtain a conceptually very simple voting protocol with unconditional privacy.
متن کاملOn Some Incompatible Properties of Voting Schemes
In this paper, we study the problem of simultaneously achieving several security properties, for voting schemes, without non-standard assumptions. This paper is a work in progress. More specifically, we focus on the universal verifiability of the computation of the tally, on the unconditional privacy/anonymity of the votes, and on the receipt-freeness properties. More precisely, under usual ass...
متن کاملInformation-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. ...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009